Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding

Communication versus Computation: Duality for multiple access channels and source coding

Computation codes in network information theory are designed for the scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding that such function decoding can be achieved more efficiently than decoding the full information sources. Compute-and-forward has shown that function...

Analog Joint Source Channel Coding for Gaussian Multiple Access Channels

We investigate the problem of transmiting independent sources over the Gaussian Multiple Access Channel (MAC) using a CDMA-like access scheme that allows users to transmit at different rates. Rather than using standard digital communications systems, we focus on analog joint source-channel coding techniques to encode each user’s source. We analyze the performance of the proposed scheme and demo...

Robust coding for multiple-access channels

Coding for T-user multiple-access channels

Coding schemes for the binary memoryless T-user adder channel are investigated in this paper. Fit upper and lower bounds on the capacity sum, which are asymptotically tight with increasing T, are derived for the noiseless case. Second, a class of T-user mdquely demdable codes with rates, asymptotically in T, equal to the maximal achievable vahes is constructed. A decoding algorithm for these co...

Reliable Computation over Multiple-Access Channels

In the standard multiple-access problem, a central access point needs to reconstruct the signals observed by each user separately. Suppose now that the access point only reconstructs the sum (or any other function) of these observed signals. For this problem, we develop strategies and information-theoretic performance bounds. It is shown that in general, separating source from channel coding le...